Mesh Compression with Random Accessibility

Previous mesh compression techniques provide nice properties such as high compression ratio, progressive decoding, and out-of-core processing. However, none of them supports the random accessibility in decoding, which enables the details of any specific part to be available without decoding other parts. This paper introduces the random accessibility to mesh compression and proposes an effective framework for the property. The key component of the framework is a wire-net mesh constructed from a chartification of the given mesh. Experimental results show that random accessibility can be achieved with competent compression ratio, only a little worse than single-rate and comparable to progressive encoding.